翻訳と辞書 Words near each other ・ Ganiou Soglo ・ Ganira Pashayeva ・ Ganirelix ・ Ganisa ・ Ganisa cyanogrisea ・ Ganisa floresiaca ・ Ganisa gyraleus ・ Ganisa longipennata ・ Ganisa plana ・ Ganisa postica ・ Ganisa pulupuluana ・ Ganisa similis ・ Ganish ・ Ganister ・ Ganit ・ Ganita Kaumudi ・ Ganita-yukti-bhasa ・ Ganitajny ・ Ganito Kami Noon, Paano Kayo Ngayon ・ Ganitumab ・ Ganiu Ogungbe ・ Ganivada ・ Ganiyu Adams ・ Ganiyu Akanbi Bello ・ Ganiyu Dawodu ・ Ganiyu Oseni ・ Ganiyu Solomon ・ Ganj ・ Ganj Afruz ・ Ganj Ali Khan Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Ganita Kaumudi ： ウィキペディア英語版 Ganita Kaumudi Ganita Kaumudi is a treatise on mathematics written by Indian mathematician Narayana Pandit in 1356. It was an arithmetical treatise alongside the other algebraic treatise called "Bijganita Vatamsa" by Narayana Pandit. It was written as a commentary on the Lilāvati by Bhāskara II. ==Contents== Ganita Kaumudi contains many results from combinatorics and continued fractions. In the text Narayana Pandit used the knowledge of simple recurring continued fraction in the solutions of indeterminate equations of the type $nx^2+k^2=y^2$. Narayana Pandit noted the equivalence of the figurate numbers and the formulae for the number of combinations of different things taken so many at a time. The book contains a rule to determine the number of permutations of ''n'' objects and a classical algorithm for finding the next permutation in lexicographic ordering though computational methods have advanced well beyond that ancient algorithm. Donald Knuth describes many algorithms dedicated to efficient permutation generation and discuss their history in his book ''The Art of Computer Programming''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Ganita Kaumudi」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.